adjacent set

мат.
смежное множество

English-Russian scientific dictionary. 2008.

Смотреть что такое "adjacent set" в других словарях:

  • Set notation — Sets are fundamental objects in mathematics. Intuitively, a set is merely a collection of elements or members . There are various conventions for textually denoting sets. In any particular situation, an author typically chooses from among these… …   Wikipedia

  • Independent set problem — In mathematics, the independent set problem (IS) is a well known problem in graph theory and combinatorics. The independent set problem is known to be NP complete. It is almost identical to the clique problem. Description Given a graph G , an… …   Wikipedia

  • Dominating set — For Dominator in control flow graphs, see Dominator (graph theory). Dominating sets (red vertices). In graph theory, a dominating set for a graph G = (V, E) is a subset D of V such that every vertex not in D is joined to at… …   Wikipedia

  • Answer set programming — (ASP) is a form of declarative programming oriented towards difficult (primarily NP hard) search problems. It is based on the stable model (answer set) semantics of logic programming. In ASP, search problems are reduced to computing stable models …   Wikipedia

  • Maximal independent set — This article is about the combinatorial aspects of maximal independent sets of vertices in a graph. For other aspects of independent vertex sets in graph theory, see Independent set (graph theory). For other kinds of independent sets, see… …   Wikipedia

  • Independent set (graph theory) — The nine blue vertices form a maximum independent set for the Generalized Petersen graph GP(12,4). In graph theory, an independent set or stable set is a set of vertices in a graph, no two of which are adjacent. That is, it is a set I of vertices …   Wikipedia

  • Independent set — The (unexpectedly asymmetric) set of 9 blue vertices is a maximal independent set for this graph of 24 vertices.In graph theory, an independent set or stable set is a set of vertices in a graph no two of which are adjacent. That is, it is a set V …   Wikipedia

  • CityRail K set — K Set K Set 85 at Parramatta railway station Upper deck of a K set after the Citydecker refurbishment …   Wikipedia

  • Edge dominating set — Examples of edge dominating sets. In graph theory, an edge dominating set for a graph G = (V, E) is a subset D ⊆ E such that every edge not in D is adjacent to at least one edge in D. An edge dominating set is also known… …   Wikipedia

  • Connected dominating set — In graph theory, a connected dominated set and a maximum leaf spanning tree are two closely related structures defined on an undirected graph. Contents 1 Definitions 2 Complementarity 3 Algorithms 4 Applic …   Wikipedia

  • Saw set — A saw set is a device used in the sharpening of hand saws. Once the teeth have been jointed and filed, the saw set is used to adjust the set of each tooth. In the past, many tradesmen and craftsmen would sharpen their own saws and a saw set would …   Wikipedia

Книги

Другие книги по запросу «adjacent set» >>


Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»

We are using cookies for the best presentation of our site. Continuing to use this site, you agree with this.